Effective operations on partial functions
نویسنده
چکیده
Once we have studied effectively computable operations on numbers it is natural to ask whether there is a comparable notion for operations on functions. The essential difference between functions and numbers as basic objects is that functions are usually infinite rather than finite. With this in mind, in §1 of this chapter we discuss the features we might reasonably expect of an effective operator on partial functions: this leads to the formulation of the definition of recursive operators on partial functions.
منابع مشابه
Quartic and pantic B-spline operational matrix of fractional integration
In this work, we proposed an effective method based on cubic and pantic B-spline scaling functions to solve partial differential equations of fractional order. Our method is based on dual functions of B-spline scaling functions. We derived the operational matrix of fractional integration of cubic and pantic B-spline scaling functions and used them to transform the mentioned equations to a syste...
متن کاملPartial second-order subdifferentials of -prox-regular functions
Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2 functions. The class of prox-regular functions covers all convex functions, lower C2 functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...
متن کاملThe Hereditary Partial Effective Functionals and Recursion Theory in Higher Types
A type-structure of partial effective functionals over the natural numbers, based on a canonical enumeration of the partial recursive functions, is developed. These partial functional, defined by a direct elementary technique, turn out to be the computable elements of the hereditary continuous partial objects; moreover, there is a commutative system of enumerations of any given type by any type...
متن کاملNegations and aggregation operators based on a new hesitant fuzzy partial ordering
Based on a new hesitant fuzzy partial ordering proposed by Garmendia et al.~cite{GaCa:Pohfs}, in this paper a fuzzy disjunction ${D}$ on the set ${H}$ of finite and nonempty subsets of the unit interval and a t-conorm ${S}$ on the set $bar{{B}}$ of equivalence class on the set of finite bags of unit interval based on this partial ordering are introduced respectively. Then, hesitant fuzzy negati...
متن کاملBasic algorithms in computational geometry with imprecise input
The domain-theoretic model of computational geometry provides us with continuous and computable predicates and binary operations. It can also be used to generalise the theory of computability for real numbers and real functions into geometric objects and geometric operations. A geometric object is computable if it is the effective limit of a sequence of finitary partial objects of the same type...
متن کامل